منابع مشابه
Gruenhage Compacta and Strictly Convex Dual Norms
We prove that if K is a Gruenhage compact space then C (K) admits an equivalent, strictly convex dual norm. As a corollary, we show that if X is a Banach space and X∗ = span|||·|||(K), where K is a Gruenhage compact in the w∗-topology and ||| · ||| is equivalent to a coarser, w∗-lower semicontinuous norm on X∗, then X∗ admits an equivalent, strictly convex dual norm. We give a partial converse ...
متن کاملStrategy-proofness, Pareto optimality and strictly convex norms
A voting scheme assigns to each profile of alternatives chosen by n individuals a compromise alternative. Here the set of alternatives is represented by the Euclidean plane. The individual utilities for the compromise point are equal to the negatives of the distances of this point to the individually best points. These distances are measured by a given strictly convex norm, common to all agents...
متن کاملA Proof of Sudakov Theorem with Strictly Convex Norms
We establish a solution to the Monge problem in N , with an asymmetric, strictly convex norm cost function, when the initial measure is absolutely continuous. We focus on the strategy, based on disintegration of measures, initially proposed by Sudakov. As known, there is a gap to fill. The missing step is completed when the unit ball is strictly convex, but not necessarily differentiable nor un...
متن کاملNorms That Generate the Same Wijsman Topology on Convex Sets
Dedicated to R. T. Rockafellar on his 60th Birthday In a Banach space X, we introduce a criterion for comparing the Wijsman topologies that are induced by two equivalent norms of X on the hyperspace of closed convex sets C(X). Thereafter, we study the duality map associated with the unit ball of a given norm of X in relation to its composition with the polarity map. This more geometrical descri...
متن کاملCores of convex and strictly convex games
We follow the path initiated in Shapley (1971) and study the geometry of the core of convex and strictly convex games. We define what we call face games and use them to study the combinatorial complexity of the core of a strictly convex game. Remarkably, we present a picture that summarizes our results with the aid of Pascal’s triangle. JEL classification: C71.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 2011
ISSN: 0024-6115
DOI: 10.1112/plms/pdr034